Turing Tumble is Turing-Complete
نویسندگان
چکیده
It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, Turing-Complete. This achieved via direct simulation a machine. Unlike previously informally presented constructions, we do not encode finite control many times, need only one trigger/ball-hopper pair, prove our construction correct. We believe this first natural extension marble-based computer has been to be universal.
منابع مشابه
Is the Network Turing-Complete?
Ensuring correct network behavior is hard. Previous state of the art has demonstrated that analyzing a network containing middleboxes is hard. In this paper, we show that even using only statically configured switches, and asking the simplest possible question – “Will this concrete packet reach the destination?” – can make the problem intractable. Moreover, we demonstrate that this is a fundame...
متن کاملEvolving Turing Complete Representations
Standard GP, chiefly concerned with evolving functions which are mappings from inputs to output, is not Turing Complete. This paper raises issues resulting from attempts at extending standard GP to Turing Complete representations. Firstly, there is a problem when a contiguous peice of code is moved to a new location (in a different program) by crossover. In general its functionality will be alt...
متن کاملTuring Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to construct Bare Bones programs by programming the state transitions of a multifunctional catalytic particle. Molecular counts represent program variables, and are altered by the action of the catalytic particle. Chemica...
متن کاملTuring-Complete Subclasses of CHR
Interesting subclasses of CHR are still Turing-complete: CHR with only one kind of rule, with only one rule, and propositional refined CHR. This is shown by programming a simulator of Turing machines (or Minsky machines) within those subclasses. Single-headed CHR without host language and propositional abstract CHR are not Turing-complete.
متن کاملThe Class Of Statically Deceptive Problems Is NP-Turing Complete
This paper identiies the complexity class of statically constructed partially deceptive problems by proving a turing reduction of 3-SAT problem to partially deceptive problem. This essentially proves that the class of partially deceptive problems is NP-turing complete and one may not be able to nd a polynomial complexity algorithm for solving deceptive problems unless P = NP. This paper also ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2023
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2023.113734